Fixpoint strategies for deductive databases
نویسندگان
چکیده
منابع مشابه
Mixed Fixpoint Theory for Disjunktive Deductive Databases
This paper deals with state generation and model generation for minimal model reasoning. We review the xpoint theory of two immediate consequence operators for databases, cf. also LoMiRa 92] and Fe 93], and prove some useful connections between them. For positive-disjunctive databases D, the rst operator T s D is based on hyperresolution. It operates on disjunctice Herbrand states and its least...
متن کاملFixpoint Iteration with Subsumption in Deductive Databases
Declarative languages for deductive and object-oriented databases require some high-level mechanism for specifying semantic control knowledge. This paper proposes user-supplied subsumption information as a paradigm to specify desired, prefered or useful deductions at the meta level. For this purpose we augment logic programming by subsumption relations and succeed to extend the classical theore...
متن کاملA Uniform Fixpoint Approach to the Implementation of Inference Methods for Deductive Databases
Within the research area of deductive databases three different database tasks have been deeply investigated: query evaluation, update propagation and view updating. Over the last thirty years various inference mechanisms have been proposed for realizing these main functionalities of a rule-based system. However, these inference mechanisms have been rarely used in commercial DB systems until no...
متن کاملA Fixpoint Approach to State Generation for Stratifiable Disjunctive Deductive Databases
In this paper we present a new fixpoint-based approach to bottom-up state generation for stratifiable disjunctive deductive databases. To this end, a new consequence operator based on hyperresolution is introduced which extends Minker’s operator for positive disjunctive Datalog rules. In contrast to already existing model generation methods our approach for efficiently computing perfect models ...
متن کاملRepresentations for Disjunctive Deductive Databases
The concepts of the dual and complementary databases as alternative representations for a given disjunctive deductive database, DB, are introduced. The dual database results from interchanging the occurrences of OR and AND operators in the positive clause representation of DB. The complementary database is deened to have as minimal models the complements of the minimal models of DB relative to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1989
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90278-i